Beam-Stack Search: Integrating Backtracking with Beam Search
نویسندگان
چکیده
We describe a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solution. Called beam-stack search, the algorithm uses a new data structure, called a beam stack, that makes it possible to integrate systematic backtracking with beam search. The resulting search algorithm is an anytime algorithm that finds a good, sub-optimal solution quickly, like beam search, and then backtracks and continues to find improved solutions until convergence to an optimal solution. We describe a memory-efficient implementation of beam-stack search, called divide-and-conquer beam-stack search, as well as an iterative-deepening version of the algorithm. The approach is applied to domain-independent STRIPS planning, and computational results show its advantages.
منابع مشابه
Fast Computation of Graph Edit Distance
The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbacks including oversized search space, huge memory consumption, and lots of expensive backtracking. In this paper, we present BSS GED, a novel vertex-based mapping method for the GED computation. First, we create a smal...
متن کاملTransition-Based Dependency Parsing with Heuristic Backtracking
We introduce a novel approach to the decoding problem in transition-based parsing: heuristic backtracking. This algorithm uses a series of partial parses on the sentence to locate the best candidate parse, using confidence estimates of transition decisions as a heuristic to guide the starting points of the search. This allows us to achieve a parse accuracy comparable to beam search, despite usi...
متن کاملInformed Backtracking Beam Search
Beam searches are a very effective algorithm for solving problems that prove intractable to complete algorithms like weighted A* and greedy search. Unfortunately, the inadmissible pruning that is the hallmark of a beam search makes the algorithm incomplete. Existing complete extensions to beam search expand pruned nodes systematically according to generation order. Selecting pruned nodes to exp...
متن کاملLimited Discrepancy Beam Search
Beam search reduces the memory consumption of bestfirst search at the cost of finding longer paths but its memory consumption can still exceed the given memory capacity quickly. We therefore develop BULB (Beam search Using Limited discrepancy Backtracking), a complete memory-bounded search method that is able to solve more problem instances of large search problems than beam search and does so ...
متن کاملBacktracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
Beam search (BS) is used as a heuristic to solve various combinatorial optimization problems, ranging from scheduling to assembly line balancing. In this paper, we develop a backtracking and an exchange-of-information (EOI) procedure to enhance the traditional beam search method. The backtracking enables us to return to previous solution states in the search process with the expectation of obta...
متن کامل